Regularized sensitivity encoding (SENSE) reconstruction using Bregman iterations.
نویسندگان
چکیده
In parallel imaging, the signal-to-noise ratio (SNR) of sensitivity encoding (SENSE) reconstruction is usually degraded by the ill-conditioning problem, which becomes especially serious at large acceleration factors. Existing regularization methods have been shown to alleviate the problem. However, they usually suffer from image artifacts at high acceleration factors due to the large data inconsistency resulting from heavy regularization. In this paper, we propose Bregman iteration for SENSE regularization. Unlike the existing regularization methods where the regularization function is fixed, the method adaptively updates the regularization function using the Bregman distance at different iterations, such that the iteration gradually removes the aliasing artifacts and recovers fine structures before the noise finally comes back. With a discrepancy principle as the stopping criterion, our results demonstrate that the reconstructed image using Bregman iteration preserves both sharp edges lost in Tikhonov regularization and fines structures missed in total variation (TV) regularization, while reducing more noise and aliasing artifacts.
منابع مشابه
Iterative Bregman Projections for Regularized Transportation Problems
This article details a general numerical framework to approximate solutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman divergence projection of a vector (representing some initial joint distribution) on the polytope of constraints. W...
متن کاملHYR2PICS: Hybrid regularized reconstruction for combined parallel imaging and compressive sensing in MRI
Both parallel Magnetic Resonance Imaging (pMRI) and Compressed Sensing (CS) are emerging techniques to accelerate conventional MRI by reducing the number of acquired data in the k-space. So far, first attempts to combine sensitivity encoding (SENSE) imaging in pMRI with CS have been proposed in the context of Cartesian trajectories. Here, we extend these approaches to non-Cartesian trajectories...
متن کاملEnhancement of four-dimensional cone-beam computed tomography by compressed sensing with Bregman iteration.
In four-dimensional (4D) cone-beam computed tomography (CBCT), there is a spatio-temporal tradeoff that currently limits the accuracy. The aim of this study is to develop a Bregman iteration based formalism for high quality 4D CBCT image reconstruction from a limited number of low-dose projections. The 4D CBCT problem is first divided into multiple 3D CBCT subproblems by grouping the projection...
متن کاملConvergence behavior of iterative SENSE reconstruction with non-Cartesian trajectories.
In non-Cartesian SENSE reconstruction based on the conjugate gradient (CG) iteration method, the iteration very often exhibits a "semi-convergence" behavior, which can be characterized as initial convergence toward the exact solution and later divergence. This phenomenon causes difficulties in automatic implementation of this reconstruction strategy. In this study, the convergence behavior of t...
متن کاملFast Dual-based Linearized Bregman Algorithm for Compressive Sensing of Digital Images
A central problem in compressive sensing is the recovery of a sparse signal using a relatively small number of linear measurements. The basis pursuit (BP) has been a successful formulation for this signal reconstruction problem. Among other things, linearized Bregman (LB) methods proposed recently are found effective to solve BP. In this paper, we present a fast linearized Bregman algorithm app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Magnetic resonance in medicine
دوره 61 1 شماره
صفحات -
تاریخ انتشار 2009